A survey of retrial queues

We present a survey of the main results and methods of the theory of retrial queues, concentrating on Markovian single and multi-channel systems. For the single channel case we consider the main model as well as models with batch arrivals, multiclasses, customer impatience, double connection, control devices, two-way communication and buffer. The stochastic processes arising from these models are considered in the stationary as well as the nonstationary regime. For multi-channel queues we survey numerical investigations of stationary distributions, limit theorems for high and low retrial intensities and heavy and light traffic behaviour.     

Single line queue with repeated demands

We analyze a model of a queueing system in which customers can only call in to request service: if the server is free, the customer enters service immediately, but if the service system is occupied, the unsatisfied customer must break contact and reinitiate his request later. Such a customer is said to be in “orbit”. In this paper we consider three models characterized by the discipline governing the order of re-request of service from orbit. First, all customers in orbit can reapply, but are discouraged and reduce their rate of demand as more customers join the orbit. Secondly, the FCFS discipline operates for the unsatisfied customers in orbit. Finally, the LCFS discipline governs the customers in orbit and the server takes an exponentially distributed vacation after each service is completed. We calculate several characteristics quantities of such systems, assuming a general service-time distribution and different exponential distributions for the times between arrivals of first and repeat requests.     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

Analysis of a Multiserver Queue with Setup Times

This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production when the system consists in a set of machines monitored by a single operator. We carry out an extensive analysis of the system including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length. AMS subject classification: 90B22, 60K25     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

The Exact Hausdorff Measure Function of the Level Sets of Multi-parameter Symmetric Stable Process

In this paper, we investigate the Hausdorff measure for level sets of N-parameter Rd-valued stable processes, and develop a means of seeking the exact Hausdorff measure function for level sets of N-parameter Rd-valued stable processes. We show that the exact Hausdorff measure function of level sets of N-parameter Rd-valued symmetric stable processes of index α is Ф（r） = r^N-d/α （log log l/r）d/α when Nα 〉 d. In addition, we obtain a sharp lower bound for the Hausdorff measure of level sets of general （N, d, α） strictly stable processes.     

Survivability in IP-over-WDM Networks: WDM Lightpath Protection versus IP LSP Protection

This article compares the performance of WDM lightpath protection and IP LSP protection schemes for IP-over-WDM networks. A mathematical formulation of the maximum throughput problem is presented and analytical expressions for recovery time are derived for both schemes. The throughputs and recovery times are analyzed and compared. Results show that the IP LSP protection scheme presents higher throughputs then WDM lightpath protection. The IP LSP protection scheme, providing individual IP LSP protection has, however, scalability problems. This scheme presents high recovery times when a failure affects many lightpaths and many hops are allowed for the primary routes of IP LSPs.     

从x出发的漂移Brownian Motion的极值分布

该文研究了从x出发的正漂移Brownian Motion的极值问题，给出了关于这种随机过程的两种极大值的定义，并主要利用Brownian Motion的一些重要性质，比如正交不变性、时空齐次性及在有限停时上的强Markov性等，获得了两种极大值的分布函数的精确表达式。     

BEPC-LINAC试验束上1GeV/c多粒子磁谱仪的设计和性能测量

试验束上2Q2D结构的磁谱仪系统由2块二极磁铁和2块四极磁铁以及位置灵敏探测器组成.该磁谱仪的接收立体角5×10^–4sr,动量范围0.2—1.3GeV/c.测量了聚焦面上的束流截面和动量谱.介绍了一种测量电子与质子飞行时间差的动量测量方法.     

The Infrared Ray Transport in an N-Layered Matched Skin

Infrared ray (IR) has great potential in medical diagnosis and therapy. In order to detect tumor in skin, we set up the steady-state and time domain IR diffusion model of an n-layered matched medium with an infinitely thick. We utilize the diffuse equation to solve a five-layered infinite matched medium and obtain the accurate solution of a matched medium of the steady state and time domain in tissue. We compare the steady-state spatially resolved reflectance calculated with Monte-Carlo simulations. The Monte-Carlo simulation shows that the solution is valid. Our equation can be used to obtain the tumor information in medical diagnosis and therapy.